Interconnections between classes of sequentially compositional temporal formulas
نویسنده
چکیده
Interval Temporal Logic (ITL) is an established formalism for reasoning about time periods. We elucidate here the relationship between various kinds of compositional propositional ITL formulas. Several are closed under conjunction and the standard temporal operator known as “box” and “always”.
منابع مشابه
Pattern-Based Refinement of Assume-Guarantee Specifications in Reactive Synthesis
We consider the problem of compositional refinement of components’ specifications in the context of compositional reactive synthesis. Our solution is based on automatic refinement of assumptions and guarantees expressed in linear temporal logic (LTL). We show how behaviors of the environment and the system can be inferred from counterstrategies and strategies, respectively, as formulas in speci...
متن کاملInduction in Compositional Model Checking
This paper describes a technique of inductive proof based on model checking. It differs from previous techniques that combine induction and model checking in that the proof is fully mechanically checked and temporal variables (process identifiers, for example) may be natural numbers. To prove ∀n.φ(n) inductively, the predicate φ(n − 1) ⇒ φ(n) must be proved for all values of the parameter n. It...
متن کاملCompositional Verification with Stutter-invariant Propositional Projection Temporal Logic
This paper investigates compositional verification with Propositional Projection Temporal Logic (PPTL). To this end, a sublogic Stutter-invariant PPTL (written as PPTLst) is first proposed. As a specification language, PPTLst helps designers get rid of irrelevant detail in compositional verification of a concurrent system since the projection construct of PPTLst allows designers to assert formu...
متن کاملPSL Model Checking and Run-Time Verification Via Testers
The paper introduces the construct of temporal testers as a compositional basis for the construction of automata corresponding to temporal formulas in the PSL logic. Temporal testers can be viewed as (non-deterministic) transducers that, at any point, output a boolean value which is 1 iff the corresponding temporal formula holds starting at the current position. The main advantage of testers, c...
متن کاملOn the Merits of Temporal Testers
The paper discusses the merits of temporal testers, which can serve as a compositional basis for automata construction corresponding to temporal formulas in the context of LTL, PSL, and MITL logics. Temporal testers can be viewed as (non-deterministic) transducers that, at any point, output a boolean value which is 1 iff the corresponding temporal formula holds starting at the current position....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 113 شماره
صفحات -
تاریخ انتشار 2013